The computational options
نویسندگان
چکیده
منابع مشابه
A Computational Scheme for Options under Jump Diffusion Processes
In this paper we develop two novel numerical methods for the partial integral differential equation arising from the valuation of an option whose underlying asset is governed by a jump diffusion process. These methods are based on a fitted finite volume method for the spatial discretization, an implicit-explicit time stepping scheme and the Crank-Nicolson time stepping method. We show that the ...
متن کاملA Computational Model for Constructing Preferences for Multiple Choice Options
When choosing between multiple alternatives, people usually do not have ready-made preferences in their mind but rather construct them on the go. The 2N-ary Choice Tree Model (Wollschlaeger & Diederich, 2012) proposes a preference construction process for N choice options from description, which is based on attribute weights, differences between attribute values, and noise. It is able to produc...
متن کاملThe Nature and Ethical Effects of Options in Electronic Transactions
Background: Electronic transactions are another form of transactions that are done through electronic tools such as mobile phones, computers, tablets, etc. Considering the synchronization of Iranchr('39')s economic system with the world and meeting the needs of the day, ensuring the correct conclusion of electronic transactions with the correct and ethical use of options is explored. The presen...
متن کاملDevelopment of computational algorithms for pricing European bond options under the influence of macro-economic conditions
A stochastic process of Vasicek type describing the short rate is considered, where the three governing parameters {φ,α, σ}, with φ for the market fitting, α for the reversion and σ for the volatility, would depend on the macro-economic condition modeled as an independent birth-death process on a finite state space. Computational algorithms are developed for evaluating the prices of European ca...
متن کاملOn the Computational Complexity of the Domination Game
The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1988
ISSN: 0028-0836,1476-4687
DOI: 10.1038/335213a0